منابع مشابه
Polylogarithmic-round Interactive Proofs for coNP Collapses the Exponential Hierarchy
It is known [BHZ87] that if every language in coNP has a constant-round interactive proof system, then the polynomial hierarchy collapses. On the other hand, Lund et al. [LFKN92] have shown that #SAT, the #P-complete function that outputs the number of satisfying assignments of a Boolean formula, can be computed by a linear-round interactive protocol. As a consequence, the coNP-complete set SAT...
متن کاملComputing Solutions Uniquely collapses the Polynomial Hierarchy
Is there an NP function that, when given a satissable formula as input, outputs one satisfying assignment uniquely? That is, can a nondeterministic function cull just one satisfying assignment from a possibly exponentially large collection of assignments? We show that if there is such a nondeterministic function, then the polynomial hierarchy collapses to ZPP NP (and thus, in particular, to NP ...
متن کاملThe Log Space Oracle Hierarchy Collapses DRAFT
The polynomial time hierarchy of Meyer and Stockmeyer has several equivalent characterizations — in particular it can be defined either in terms of polynomial time oracle Turing machines [Sto76], or in terms of polynomial time alternating Turing machines where the number of alternations is finitely bounded [CKS81]. One of the most important open questions in the area is whether or not this hier...
متن کاملStrong Homotopy Types, Nerves and Collapses
We introduce the theory of strong homotopy types of simplicial complexes. Similarly to classical simple homotopy theory, the strong homotopy types can be described by elementary moves. An elementary move in this setting is called a strong collapse and it is a particular kind of simplicial collapse. The advantage of using strong collapses is the existence and uniqueness of cores and their relati...
متن کاملThe hierarchy inside closed monadic Σ1 collapses on the infinite binary tree
Closed monadic Σ1, as proposed in [AFS98], is the existential monadic second order logic where alternation between existential second order quantifiers and first order quantifiers is allowed. Despite some effort very little is known about the expressive power of this logic on finite structures. We construct a tree automaton which exactly characterizes closed monadic Σ1 on the Rabin tree and giv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1989
ISSN: 0022-0000
DOI: 10.1016/0022-0000(89)90025-1